A uniform tableau method for intuitionistic modal logics I
نویسندگان
چکیده
We present tableau systems and sequent calculi for the intuitionistic analogues and IS5 of the normal classical modal logics. We provide soundness and completeness theorems with respect to the models of intuitionistic logic enriched by a modal accessibility relation, as proposed by G. We also investigate the relationship of these logics with some other intuitionistic modal logics proposed in the literature.
منابع مشابه
MetTeL: A Tableau Prover with Logic-Independent Inference Engine
MetTeL is a generic tableau prover for various modal, intuitionistic, hybrid, description and metric logics. The core component of MetTeL is a logic-independent tableau inference engine. A novel feature is that users have the ability to flexibly specify the set of tableau rules to be used in derivations. Termination can be achieved via a generalisation of a standard loop checking mechanism or u...
متن کاملAlmost Duplication-Free Tableau Calculi for Propositional Lax Logics
In this paper we provide tableau calculi for the intuitionistic modal logics PLL and PLL 1 , where the calculus for PLL 1 is duplication{free while among the rules for PLL there is just one rule that allows duplication of formulas. These logics have been investigated by Fairtlough and Mendler in relation to the problem of Formal Hardware Veriication. In order to develop these calculi we extend ...
متن کاملTableau methods of proof for modal logics
1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...
متن کاملA Tableau Compiled Labelled Deductive System for Hybrid Logic
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...
متن کاملUniform interpolation and the existence of sequent calculi
General conditions on sequent calculi are formulated under which the intermediate and modal logics corresponding to the calculi have uniform interpolation. It follows that the intuitionistic versions of K and KD, as well as several other intuitionistic modal logics, have uniform interpolation. It also follows that no intermediate or intuitionistic modal logic without uniform interpolation has a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 53 شماره
صفحات -
تاریخ انتشار 1994